Domain decomposition with nonmatching grids: augmented Lagrangian approach

Domain Decomposition with Nonmatching Grids: Augmented Lagrangian Approach

We propose and study a domain decomposition method which treats the constraint of displacement continuity at the interfaces by augmented Lagrangian techniques and solves the resulting problem by a parallel version of the Peaceman-Rachford algorithm. We prove that this algorithm is equivalent to the fictitious overlapping method introduced by P.L. Lions. We also prove its linear convergence inde...

Overlapping Domain Decomposition with Non - Matching Grids

A Domain Decomposition Method Based on Augmented Lagrangian with a Penalty Term in Three Dimensions

In our earlier work [4], a dual iterative substructuring method for two dimensional problems was proposed, which is a variant of the FETI-DP method. The proposed method imposes continuity on the interface by not only the pointwise matching condition but also uses a penalty term which measures the jump across the interface. For a large penalization parameter, it was proven that the condition num...

Domain Decomposition Approach for Automatic Parallel Generation of Tetrahedral Grids

The desire to simulate more and more geometrical and physical features of technical structures and the availability of parallel computers and parallel numerical solvers which can exploit the power of these machines have lead to a steady increase in the number of grid elements used. Memory requirements and computational time are too large for usual serial PCs. An a priori partitioning algorithm ...

Algebraic Domain Decomposition Method for Unstructured Grids